Magnet with Ferromagnetic Nearest-Neighbor and Antiferromagnetic Next-Nearest-Neighbor Exchange Interactions

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Renormalization Group Studies of Antiferromagnetic Chains I . * Nearest - Neighbor Interactions

The SLAC real-space renormalization group method is used to study one-dimensional antiferromagnetic chains at zero temperature. Calculations using three-site blocks (for the Heisenberg-Ising model) and two-site blocks (for the isotropic Heisenberg model) are compared with exact results. In connection with the two-site calculation a duality transformation is introduced under which the isotropic ...

متن کامل

Two Dimensional Ising Spin Glass with ferromagnetic next-nearest-neighbor interactions

By means of extensive computer simulations we analyze in detail the two dimensional ±J Ising spin glass with ferromagnetic next-nearest-neighbor interactions. We found a crossover from ferromagnetic to “spin glass” like order both from numerical simulations and analytical arguments. We also present evidences of a second crossover from the “spin glass” behavior to a paramagnetic phase for the la...

متن کامل

Fast Approximate Nearest-Neighbor Search with k-Nearest Neighbor Graph

We introduce a new nearest neighbor search algorithm. The algorithm builds a nearest neighbor graph in an offline phase and when queried with a new point, performs hill-climbing starting from a randomly sampled node of the graph. We provide theoretical guarantees for the accuracy and the computational complexity and empirically show the effectiveness of this algorithm.

متن کامل

Nearest Neighbor

Over the last decade, an immense amount of data has become available. From collections of photos, to genetic data, and to network traffic statistics, modern technologies and cheap storage have made it possible to accumulate huge datasets. But how can we effectively use all this data? The ever growing sizes of the datasets make it imperative to design new algorithms capable of sifting through th...

متن کامل

Nearest Neighbor and Reverse Nearest Neighbor Queries for Moving Objects

With the proliferation of wireless communications and the rapid advances in technologies for tracking the positions of continuously moving objects, algorithms for efficiently answering queries about large numbers of moving objects increasingly are needed. One such query is the reverse nearest neighbor (RNN) query that returns the objects that have a query object as their closest object. While a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Acta Physica Polonica A

سال: 2009

ISSN: 0587-4246,1898-794X

DOI: 10.12693/aphyspola.115.925